Finger Search Trees
نویسنده
چکیده
University of Aarhus 11.1 Finger Searching. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11-1 11.2 Dynamic Finger Search Trees . . . . . . . . . . . . . . . . . . . . . . . 11-2 11.3 Level Linked (2,4)-Trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11-3 11.4 Randomized Finger Search Trees . . . . . . . . . . . . . . . . . . . 11-4 Treaps • Skip Lists 11.5 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11-6 Optimal Merging and Set Operations • Arbitrary Merging Order • List Splitting • Adaptive Merging and Sorting
منابع مشابه
Finger Search on Balanced Search Trees
This thesis introduces the concept of a heterogeneous decomposition of a balanced search tree and apply it to the following problems: • How can finger search be implemented without changing the representation of a Red-Black Tree, such as introducing extra storage to the nodes? (Answer: Any degree-balanced search tree can support finger search without modification in its representation by mainta...
متن کاملFinger trees: a simple general-purpose data structure
We introduce 2-3 finger trees, a functional representation of persistent sequences supporting access to the ends in amortized constant time, and concatenation and splitting in time logarithmic in the size of the smaller piece. Representations achieving these bounds have appeared previously, but 2-3 finger trees are much simpler, as are the operations on them. Further, by defining the split oper...
متن کاملPurely Functional 1-2 Brother Trees
Enter the computing arboretum and you will find a variety of well-studied trees: AVL trees (Adel’son-Vel’skiı̆ & Landis, 1962), symmetric binary B-trees (Bayer, 1972), Hopcroft’s 2-3 trees (Aho et al., 1974), the bushy finger trees (Guibas et al., 1977), and the colourful red-black trees (Guibas & Sedgewick, 1978). In this pearl, we look at a more exotic species of balanced search trees, 1-2 bro...
متن کاملDistances and Finger Search in Random Binary Search Trees
For the random binary search tree with n nodes inserted the number of ancestors of the elements with ranks k and `, 1 ≤ k < ` ≤ n, as well as the path distance between these elements in the tree are considered. For both quantities central limit theorems for appropriately rescaled versions are derived. For the path distance the condition ` − k → ∞ as n → ∞ is required. We obtain tail bounds and ...
متن کاملProbabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004